A Feti Method for a Tdnns Discretization of Plane Elasticity∗

نویسندگان

  • A. Pechstein
  • C. Pechstein
  • ASTRID PECHSTEIN
  • Joachim Schöberl
چکیده

In this article, we consider a hybridized tangential-displacement normal-normalstress (TDNNS) discretization of linear elasticity. As shown in earlier work by Joachim Schöberl and the first author, TDNNS is a stable finite element discretization that does not suffers from volume locking. We propose a finite element tearing and interconnecting (FETI) method in order to solve the resulting linear system iteratively. The method is analyzed thoroughly for the compressible case in two dimensions, leading to a condition number bound of C(1 + log(H/h))2, which coincides with known bounds of many other iterative substructuring methods. Numerical results confirm our theoretical findings. Furthermore, our experiments show that a certain instance of the method remains stable even in the almost incompressible limit.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

JOHANNES KEPLER UNIVERSITY LINZ Institute of Computational Mathematics A FETI Method For A TDNNS Discretization of Plane Elasticity

In this article, we consider a hybridized tangential-displacement normal-normalstress (TDNNS) discretization of linear elasticity. As shown in earlier work by Joachim Schöberl and the first author, TDNNS is a stable finite element discretization that does not suffers from volume locking. We propose a finite element tearing and interconnecting (FETI) method in order to solve the resulting linear...

متن کامل

A FETI-DP Formulation of Three Dimensional Elasticity Problems with Mortar Discretization

Abstract. In this paper, a FETI-DP formulation for the three dimensional elasticity problem on non-matching grids over a geometrically conforming subdomain partition is considered. To resolve the nonconformity of the finite elements, a mortar matching condition on the subdomain interfaces (faces) is imposed. By introducing Lagrange multipliers for the mortar matching constraints, the resulting ...

متن کامل

Dual-Primal FETI Method

The FETI algorithms are numerically scalable iterative domain decomposition methods. These methods are well documented for solving equations arising from the Finite Element discretization of second or fourth order elasticity problems. The one level FETI method equipped with the Dirichlet preconditioner was shown to be numerically scalable for second order elasticity problems while the two level...

متن کامل

A Feti-dp Algorithm for Elasticity Problems with Mortar Discretization on Geometrically Non-conforming Partitions

Abstract. In this paper, a FETI-DP formulation for three dimensional elasticity on non-matching grids over geometrically non-conforming subdomain partitions is considered. To resolve the nonconformity of the finite elements, a mortar matching condition is imposed on the subdomain interfaces (faces). A FETI-DP algorithm is then built by enforcing the mortar matching condition in dual and primal ...

متن کامل

2 Charbel Farhat And

We present a formulation of the FETI substructuring method as a matrix preconditioning algorithm and report on theoretical results and practical experience in large scale parallel implementations. The method has quasi-optimal convergence properties: the condition number can be proved to be independent of the number of subdomains, and to grow at most polylogarithmically with the number of elemen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014